An Algorithm for VP Ellipsis
نویسنده
چکیده
An algorithm is proposed to determine antecedents for VP ellipsis. The algorithm eliminates impossible antecedents, and then imposes a preference ordering on possible antecedents. The algorithm performs with 94% accuracy on a set of 304 examples of VP ellipsis collected from the Brown Corpus. The problem of determining antecedents for VP ellipsis has received little attention in the literature, and it is shown that the current proposal is a significant improvement over alternative approaches. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-93-05. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/416 An Algorithm for VP Ellipsis MS-CIS-93-05 LINC LAB 244
منابع مشابه
Not Voice but Case Identity in VP Ellipsis of English
This paper develops a Case/case-theoretic acco unt for what Merchant (2008) calls voice mism atch in ellipsis constructions of English. Merch ant (ibid.) reports that VP ellipsis as an elision o f smaller size VP allows voice mismatch, but Ps eudogapping and Sluicing as an elision of bigge r size vP/TP do not. However, Tanaka (2011) ar gues against Merchant's dichotomy in voice mis match betwee...
متن کاملSome Problematic Cases of VP Ellipsis
It has been widely assumed that VP ellipsis is governed by an identity condition: the elided VP is interpreted as an identical copy of another expression in surrounding discourse. For example, Sag (76) imposes an identity condition on Logical Form representations of VP's. A basic feature of this account is the requirement that a syntactic VP be available as the antecedent. This requirement is r...
متن کاملA Unified Approach to VP-ellipsis and VP-anaphora
It is known that VP-ellipsis and VP-anaphora are typologically different phenomena. English has VP-ellipses whereas Korean has VP-anaphora. The goals of this paper are (i) to develop a unified algorithm which can analyze these two different phenomena and (ii) to explain them using the developed resolution algorithm. In order to analyze these phenomena, this paper incorporates Jäger (2010)’s ana...
متن کاملA Generalized Reconstruction Algorithm For Ellipsis Resolution
We present an algorithm which assigns interpretations to several major types of ellipsis structures through a generalized procedure of syntactic reconstruction. Ellipsis structures are taken to be sequences of lexically realized arguments and/or adjuncts of an empty verbal head. Reconstruction is characterized as the specification of a (partial) correspondence relation between the unrealized he...
متن کاملGeneration of VP Ellipsis: A Corpus-Based Approach
We present conditions under which verb phrases are elided based on a corpus of positive and negative examples. Factor that affect verb phrase ellipsis include: the distance between antecedent and ellipsis site, the syntactic relation between antecedent and ellipsis site, and the presence or absence of adjuncts. Building on these results, we examine where in the generation architecture a trainab...
متن کامل